Polarity preserving decon in “N log N” time
نویسنده
چکیده
A slight modification to Fourier spectral factorization enables deconvolution to preserve and enhance seismogram polarities. It spikes the center lobe of the Ricker wavelet. It works by tapering at small lags the antisymmetric part of the time-domain representation of the log spectrum.
منابع مشابه
Decon in the log domain with variable gain
Because predictive decon fails on the Ricker wavelet, earlier we devised an extension to non-minimum phase wavelets (Yang et al, 2011). It showed remarkable clarity of seismogram polarity. Here we improve our method by a log spectral parameterization. Another innovation here is correctly handling time-variable gain. Since filtering does not commute with TV gain, gain is now done after decon (no...
متن کاملSix tests of sparse log decon
Previously, we developed a sparseness-goaled decon method. Here we test it on six data sets. None showed the unfortunate phase-shift we always see with minimum-phase decon. None showed the polarity reversals or time shifts that perplexed our earlier work. Results on all six data sets enhance polarity visibility. We had expected to see sparseness decon limit the bandwidth in some natural way unl...
متن کاملSix tests of sparse log decon
Previously we developed a sparseness-goaled decon method. Here we test it on six data sets. None showed the unfortunate phase-shift we always see with minimumphase decon. None showed polarity reversals or time shifts that perplexed our earlier work. Results on all six data sets enhance polarity visibility. We had expected to see sparseness decon limit the bandwidth in some natural way unlike pr...
متن کاملLinear Functions Preserving Sut-Majorization on RN
Suppose $textbf{M}_{n}$ is the vector space of all $n$-by-$n$ real matrices, and let $mathbb{R}^{n}$ be the set of all $n$-by-$1$ real vectors. A matrix $Rin textbf{M}_{n}$ is said to be $textit{row substochastic}$ if it has nonnegative entries and each row sum is at most $1$. For $x$, $y in mathbb{R}^{n}$, it is said that $x$ is $textit{sut-majorized}$ by $y$ (denoted by $ xprec_{sut} y$) if t...
متن کاملAn Encoding for Order-Preserving Matching
Encoding data structures store enough information to answer the queries they are meant to support but not enough to recover their underlying datasets. In this paper we give the first encoding data structure for the challenging problem of order-preserving pattern matching. This problem was introduced only a few years ago but has already attracted significant attention because of its applications...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012